Printed Copies: Eecient Boolean Manipulation with Obdd's Can Be Extended to Fbdd's Eecient Boolean Manipulation with Obdd's Can Be Extended to Fbdd's Universitt at Trier D{54286 Trier Revised Version
نویسندگان
چکیده
Electronic copies of technical reports are available: Via FTP: URL ftp://ftp.informatik.uni-trier.de/pub/Users-Root/reports Via WWW: URL http://www.informatik.uni-trier.de/Reports/Current.html Via email: Send a mail to [email protected], subject ’HELP’, for detailed instructions Printed copies: Trierer Forschungsberichte Fachbereich IV Mathematik / Informatik Universitat Trier ..
منابع مشابه
Boolean Manipulation with Free BDD's - First Experimental Results
It is shown that Free Binary Decision Diagrams (FBDD's), with respect to a predeened type, provide a canonical representation and allow eecient solutions of the basic tasks in Boolean manipulation similarly as the well{known OBDD's do. But in contrast to OBDD's, typed FBDD's allow more succinct representations of Boolean functions. For experimentation we have used an FBDD{ package. The types we...
متن کاملMod-2-OBDD's: A Generalization of OBDD's and EXOR-Sum-of-Products
We present a data structure | the Mod{2{OBDD's that considerably extend OBDD's (ordered binary decision diagrams) as well as ESOP's (EXOR{sum{of{ products). Many Boolean function of practical interest like hidden weighted bit function, indirect storage access function, important symmetric functions have exponential size optimal OBDD's and/or ESOP's (even multilevel EXOR{expressions) but (low de...
متن کاملBlock-Restricted Reordering - Extended Experiments
Ordered Binary Decision Diagrams (OBDDs) are so far the most eecient representation scheme for manipulation of Boolean functions in computer-aided design and veriication of digital systems. The concise-ness of an OBDD representation depends on the choice of the variable ordering, and the minimization problem that can be formulated as the problem of nding an ordering that minimizse the OBDD size...
متن کاملAnalysis and Manipulation of Boolean Functionsin
Electronic copies of technical reports are available: Via FTP: URL ftp://ftp.informatik.uni-trier.de/pub/Users-Root/reports Via WWW: URL http://www.informatik.uni-trier.de/Reports/Current.html Via email: Send a mail to [email protected], subject ’HELP’, for detailed instructions Printed copies: Trierer Forschungsberichte Fachbereich IV Mathematik / Informatik Universitat Trier ..
متن کاملFrontiers of Feasible and Probabilistic Feasible Boolean Manipulation with Branching Programs
Extended Abstract Abstract. A central issue in the solution of many computer aided design problems is to nd concise representations for circuit designs and their functional speciication. Recently, a restricted type of branching programs (OBDDs) proved to be extremely useful for representing Boolean functions for various CAD applications Bry92]. Unfortunatelly, many circuits of practical interes...
متن کامل